Regret Analysis of the Anytime Optimally Confident UCB Algorithm Tor Lattimore Department of Computing Science University of Alberta, Canada

Source URL: downloads.tor-lattimore.com

Deterministic Anytime Inference for Stochastic Continuous-Time Markov Processes E. Busra Celikkaya University of California, Riverside CELIKKAE @ CS . UCR . EDU

Source URL: rlair.cs.ucr.edu

• Graphical models
• Statistics
• Applied mathematics
• Mathematics
• Estimation theory
• Bayesian network
• Networks
• Gibbs sampling
• Belief propagation
• Expectationmaximization algorithm
• Computation tree

Genome Informatics 12: 73–A Multi-Queue Branch-and-Bound Algorithm for Anytime Optimal Search

Source URL: www.jsbi.org

• Combinatorial optimization
• Mathematics
• Search algorithms
• Applied mathematics
• Routing algorithms
• Probability theory
• Stochastic processes
• A* search algorithm
• Game artificial intelligence
• Branch and bound
• Priority queue
• Algorithm

A Distributed Anytime Algorithm for Dynamic Task Allocation in Multi-Agent Systems Kathryn S. Macarthur, Ruben Stranders, Sarvapali D. Ramchurn and Nicholas R. Jennings {ksm08r,rs2,sdr,nrj}@ecs.soton.ac.uk School of Elec

Source URL: www.orchid.ac.uk

A Complete Anytime Algorithm for Treewidth Vibhav Gogate and Rina Dechter School of Information and Computer Science, University of California, Irvine, CA 92967 {vgogate,dechter}@ics.uci.edu

Source URL: www.hlt.utdallas.edu

Anytime Behaviour of Mixed CSP Solving Neil Yorke-Smith and Christophe Guettier IC–Parc, Imperial College London, SW7 2AZ, U.K. fnys, Abstract An algorithm with the anytime property has an approxi

Source URL: www.cri.ensmp.fr

Anytime Motion Planning using the RRT∗ Sertac Karaman Matthew R. Walter Alejandro Perez

Source URL: ttic.uchicago.edu

• Artificial intelligence
• Applied mathematics
• Robot control
• Rapidly-exploring random tree
• Combinatorial optimization
• Routing algorithms
• Motion planning
• A* search algorithm
• Anytime algorithm
• Search algorithms
• Theoretical computer science
• Mathematics

Anytime Incremental Planning with E-Graphs Mike Phillips1 and Andrew Dornbush1 and Sachin Chitta2 and Maxim Likhachev1 Abstract— Robots operating in real world environments need to find motion plans quickly. Robot moti

Source URL: www.cs.cmu.edu

• Applied mathematics
• Combinatorial optimization
• Routing algorithms
• A* search algorithm
• Game artificial intelligence
• Motion planning
• Breadth-first search
• Induced path
• Heuristic function
• Graph theory
• Search algorithms
• Mathematics

Anytime Search-Based Footstep Planning with Suboptimality Bounds Armin Hornung Andrew Dornbush

Source URL: hrl.informatik.uni-freiburg.de

• Mathematics
• Combinatorial optimization
• Applied mathematics
• Routing algorithms
• A* search algorithm
• Heuristic function
• Motion planning
• Admissible heuristic
• Heuristic
• Search algorithms
• Heuristics
• Artificial intelligence

Journal of Artificial Intelligence Research–567 Submitted 09/08; publishedAn Anytime Algorithm for Optimal Coalition Structure Generation Talal Rahwan

Source URL: jair.org

• Applied mathematics
• Numerical analysis
• Search algorithms
• Combinatorial optimization
• Algorithm
• Mathematical logic
• Genetic algorithm
• Dynamic programming
• Anytime algorithm
• Mathematical optimization
• Operations research
• Mathematics